Automating Elementary Interpretations
نویسندگان
چکیده
We report on an implementation of elementary interpretations for automatic termination proofs.
منابع مشابه
Automatic Proofs of Termination With Elementary Interpretations
Symbolic constraints arising in proofs of termination of programs are often translated into numeric constraints before checking them for satisfiability. In this setting, polynomial interpretations are a simple and popular choice. In the nineties, Lescanne introduced the elementary algebraic interpretations as a suitable alternative to polynomial interpretations in proofs of termination of term ...
متن کاملCombinatorial Interpretations of Particular Evaluations of Complete and Elementary Symmetric Functions
The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced by Everitt et al. (2002) and (2007) in the spectral theory. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary and complete symmetric functions. We then study combinatorial interpretations of this specialization and obta...
متن کاملLyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions
Let hλ, eλ, and mλ denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition λ respectively. We give combinatorial interpretations for the coefficients that arise in expanding mλ in terms of homogeneous symmetric functions and the elementary symmetric functions. Such coefficients are interpreted in terms of cer...
متن کاملOntology Correspondence via Theory Interpretation
We report on ongoing work to apply techniques of automated theory morphism search in first-order logic to ontology matching and alignment problems. Such techniques are able to discover ‘structural similarities’ across different ontologies by providing theory interpretations of one ontology into another. We sketch the techniques currently available for automating the task of finding theory inter...
متن کاملNuprl as Logical Framework for Automating Proofs in Category Theory
We describe the construction of a semi-automated proof system for elementary category theory using the Nuprl proof development system as logical framework. We have used Nuprl’s display mechanism to implement the basic vocabulary and Nuprl’s rule compiler to implemented a first-order proof calculus for reasoning about categories, functors and natural transformations. To automate proofs we have f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014